Alternating automata and temporal logic normal forms

On the Relationship between -automata and Temporal Logic Normal Forms

We consider the relationship between -automata and a specific logical formulation based on a normal form for temporal logic formulae. While this normal form was developed for use with execution and clausal resolution in temporal logics, we here show how it can represent, syntactically, -automata in a high-level way. Technical proofs of the correctness of this representation are given.

Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

We introduce a novel automata-theoretic approach for the verification of multi-agent systems. We present epistemic alternating tree automata, an extension of alternating tree automata, and use them to represent specifications in the temporal-epistemic logic CTLK. We show that model checking a memory-less interpreted system against a CTLK property can be reduced to checking the language non-empt...

On the Relationship between ω-Automata and Temporal Logic Normal Forms

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

We present a new procedure for the translation of propositional linear-time temporal logic (LTL) formulas to equivalent nondeterministic Büchi automata. Our procedure is based on simulation relations for alternating Büchi automata. Whereas most of the procedures that have been described in the past compute simulation relations in the last step of the translation (after a nondeterministic Büchi ...

Graded Alternating-Time Temporal Logic

Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community: μ-calculus, in [KSV02], and Ctl in [FNP08]. In both these settings, graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Both μ-calculus and Ctl n...